Relire Ménandre. Eric Handley , André Hurst

A conjecture of Yves André . ∗

The introduction to [2] (and references contained therein) contains a comprehensive exposition of terminology and notations relative to this conjecture. Since we use the same terminology and notations, we do not reproduce them here. The introduction to [2] also contains an exposition of results on this conjecture obtained before the article [3] came out. In this article we prove the following t...

Estimating the Hurst Exponent

The Hurst Exponent is a dimensionless estimator for the self-similarity of a time series. Initially defined by Harold Edwin Hurst to develop a law for regularities of the Nile water level, it now has applications in medicine and finance. Meaningful values are in the range [0, 1]. Different methods for estimating the Hurst Exponent have been evaluated: The classical “Rescaled Range” method devel...

Category : Standards Track M . Handley UCL

The Datagram Congestion Control Protocol (DCCP) is a transport protocol that provides bidirectional unicast connections of congestion-controlled unreliable datagrams. DCCP is suitable for applications that transfer fairly large amounts of data and that can benefit from control over the tradeoff between timeliness and reliability.

François Bach and André Herbelin

Reals which Compute Little André

We investigate combinatorial lowness properties of sets of natural numbers (reals). The real A is super-low if A′ ≤tt ∅′, and A is jump-traceable if the values of {e}A(e) can be effectively approximated in a sense to be specified. We investigate those properties, in particular showing that super-lowness and jump-traceability coincide within the r.e. sets but none of the properties implies the o...